Traffic Measurement System with Trap and Polling Methods and Its Performance
نویسندگان
چکیده
We propose a traffic measurement system which uses trap and polling methods. To obtain its performance we consider a queueing model with a single server and evaluate a packet delay. In our multi-cast traffic, packets are modeled as a batch with a batch size distribution {gk}. The batch arrival process is observed as two processes on the basis of batch size. For a batch whose size is more than or equal to a threshold L, the batch will be trapped by our traffic measurement system (in queueing model, it will enter a queue immediately after its arrival). For a batch whose size is less than L, it will be observed at a polling cycle T (in queueing model, it will be temporarily stored in a buffer and all these small batches will be cyclically noticed with a cycle T ). We analyze this queueing model by a diffusion approximation and compare the packet delay observed by our traffic measurement system with the L = 1 original batch arrival model. Evaluating the results of the diffusion approximation, we illustrate that our traffic measurement system has functions not only to give an accurate estimation of the mean waiting time but also reduce the number of measurements by choosing appropriate parameters L and T . key words: multi-cast traÆc, distributed network system, traÆc
منابع مشابه
Polling-systems-based Autonomous Vehicle Coordination in Traffic Intersections with No Traffic Signals
The rapid development of autonomous vehicles spurred a careful investigation of the potential benefits of allautonomous transportation networks. Most studies conclude that autonomous systems can enable drastic improvements in performance. A widely studied concept is all-autonomous, collision-free intersections, where vehicles arriving in a traffic intersection with no traffic light adjust their...
متن کاملDecomposition results for general polling systems and their applications
In this paper we derive decomposition results for the number of customers in polling systems under arbitrary (dynamic) polling order and service policies. Furthermore, we obtain sharper decomposition results for both the number of customers in the system and the waiting times under static polling policies. Our analysis, which is based on distributional laws, relaxes the Poisson assumption that ...
متن کاملExpected Delay Analysis of Polling Systems in Heavy Traffic
We study the expected delay in a cyclic polling model with mixtures of exhaustive and gated service in heavy traffic. We obtain closed-form expressions for the mean delay under standard heavy-traffic scalings, providing new insights into the behaviour of polling systems in heavy traffic. The results lead to excellent approximations of the expected waiting times in practical heavy-load scenarios...
متن کاملHeavy traffic analysis of polling models by mean value analysis
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We consider the classical cyclic polling model with exhaustive or gated service at each queue, and with general service-time and switch-over time distributions, and study its behavior when the load tends to one. For this model, we explore the recently proposed mean value analysis (MVA), which takes a...
متن کاملLiterature Review of Traffic Assignment: Static and Dynamic
Rapid urban growth is resulting into increase in travel demand and private vehicle ownership in urban areas. In the present scenario the existing infrastructure has failed to match the demand that leads to traffic congestion, vehicular pollution and accidents. With traffic congestion augmentation on the road, delay of commuters has increased and reliability of road network has decreased. Four s...
متن کامل